Convergence results for a class of time-varying simulated annealing algorithms
نویسندگان
چکیده
منابع مشابه
On the Convergence Time of Simulated Annealing
Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimization problems. In practice they have been applied to solve some presumably hard (e.g., NP-complete) problems. The level of performance obtained has been promised [5, 2, 6, 14]. The success of its heuristic technique has motivated analysis of this algorithm from a theoretical point of view. In parti...
متن کاملSimulated Annealing Algorithms for Continuous Global Optimization: Convergence Conditions
In this paper, simulated annealing algorithms for continuous global optimization are considered. After a review of recent convergence results from the literature, a class of algorithms is presented for which strong convergence results can be proved without introducing assumptions which are too restrictive. The main idea of the paper is that of relating both the temperature value and the support...
متن کاملConvergence and first hitting time of simulated annealing algorithms for continuous global optimization
In this paper simulated annealing algorithms for continuous global optimization are considered. Under the simplifying assumption of known optimal value, the convergence of the algorithms and an upper bound for the expected rst hitting time, i.e. the expected number of iterations before reaching the global optimum value within accuracy ", are established. The obtained results are compared with t...
متن کاملParallel Simulated Annealing Algorithms
n different nodes of the network. The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP). Both algorithms showed very good performance in terms of solution time and solution quality. The rest of the paper is organized in the following fashion. Section II describes the simulated annealing technique. Section III presents the cluster ...
متن کاملEnergy Transforms for Metropolis and Simulated Annealing Algorithms Energy Transforms for Metropolis and Simulated Annealing Algorithms
We present here a method to speed up Metropolis algorithms which can be viewed as an alternative to simulated annealing. We show that this method of energy transformation compares favourably with simulated annealing in the asymptotic of a close to one probability of convergence. It requires an estimate of the minimum value of the energy function to be known, but if only a loose estimate is avai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2018
ISSN: 0304-4149
DOI: 10.1016/j.spa.2017.07.007